Monday, February 3.

Lecture 3 — February 23 , 2012

Planar point location is a problem in which we are given a planar graph (with no crossings) defining a map, such as the boundary of GUI elements. Then we wish to support a query that takes a point given by its coordinates (x, y) and returns the face that contains it (see Figure 1 for an example). As is often the case with these problems, there is both a static and dynamic version of this proble...

Access published February 3 , 2007

Access published February 3 , 2007

Examination of all against all comparisons (see below) using this scoring function found that some families consistently scored higher than others. For example some families of membrane proteins would score more highly against other membrane proteins probably due to biases in sequence composition. Therefore, for each pairwise comparison of search outputs the following normali-zation is carried ...

Monday Workshop Presenters : Title :

The nonsmooth composite minimization problem, whose objective function is the sum of an average of N smooth (possibly nonconvex) functions plus a proper closed convex function, is widely studied in large-scale machine learning, statistics and optimization. Unlike the numerous stochastic firstorder methods, the knowledge on stochastic second-order methods for this problem is very limited. In thi...

Monday, September 24, 2007

The Center for Neural Interface Design of the Biodesign Institute at Arizona State University conducted an experiment to investigate how the central nervous system controls hand orientation and movement direction during reach-to-grasp movements. ANOVA (Analysis of Variance), a conventional data analysis widely used in neural science, was performed to categorized different neural activities. Som...